A Survey of Heuristics for Domain-Independent Planning

نویسنده

  • Ruishi Liang
چکیده

Increasing interest has been devoted to Planning as Heuristic Search over the years. Intense research has focused on deriving accurate heuristics in polynomial computational time for domain-independent planning. This paper reports on an extensive survey and analysis of research work related to heuristic derivation techniques for state space search planning, as well as other planning paradigms. Survey results reveal that heuristic techniques have been extensively applied in many efficient planners and result in impressive performances. We extend the survey analysis to suggest promising avenues for future research in heuristic derivation and heuristic search techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning

Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively guide the search. Pattern database heuristics (PDBs), which are based on abstractions of the search space, are currently one of the most promising approaches to developing better admissible heuristics. The informedness of...

متن کامل

The Need for Di erent Domain-Independent Heuristics

prodigy's planning algorithm uses domain-independent search heuristics. In this paper, we support our belief that there is no single search heuristic that performs more e ciently than others for all problems or in all domains. The paper presents three di erent domain-independent search heuristics of increasing complexity. We run prodigy with these heuristics in a series of arti cial domains (in...

متن کامل

Kernel Regression for Planning Heuristics

Modern automated planning revolves around forward state-space heuristic search. These planners guide their search with powerful domain-independent heuristics that estimate the distance to a goal state by efficiently solving related, but simplified, planning problems. This approximation trades off efficiently with approximation quality. In the past 15 years, the Planning and Learning community h...

متن کامل

Towards learning domain-independent planning heuristics

Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its computational complexity resulting from exponentially large search spaces. Heuristic approaches are necessary to solve all but the simplest problems. In this wor...

متن کامل

Exploration and Combination: Randomized and Multi-Strategies Search in Satisficing Planning

Heuristic (Informed) Search takes advantage of problemspecific knowledge beyond the definition of the problem itself to find solutions more efficiently than uninformed search, such as Breadth-First Search (BFS) and Depth-First Search (DFS). We design domain-dependent search algorithms to plan tasks. However, the domain-dependent design pattern cannot be applied to fully automatic domains, such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012